#include <bits/stdc++.h>
using namespace std;
class Solution
{
public:
  int search(vector<int> &nums, int target)
  {
    int l = -1, r = nums.size();
    int mid;
    while (l + 1 < r)
    {
      mid = l + (r - l) / 2;
      if (nums[mid] <= target)
        l = mid;
      else
        r = mid;
    }
    return (l >= 0 && nums[l] == target) ? l : -1;
  }
};
int main()
{
  Solution s;

  return 0;
}
